Data-efficient learning of feedback policies from image pixels using deep dynamical models

Data-efficient reinforcement learning (RL) in continuous state-action spaces using very high-dimensional observations remains a key challenge in developing fully autonomous systems. We consider a particularly important instance of this challenge, the pixels-to-torques problem, where an RL agent learns a closed-loop control policy ( torques ) from pixel information only. We introduce a data-efficient, model-based reinforcement learning algorithm that learns such a closed-loop policy directly from pixel information. The key ingredient is a deep dynamical model for learning a low-dimensional feature embedding of images jointly with a predictive model in this low-dimensional feature space. Joint learning is crucial for long-term predictions, which lie at the core of the adaptive nonlinear model predictive control strategy that we use for closed-loop control. Compared to state-of-the-art RL methods for continuous states and actions, our approach learns quickly, scales to high-dimensional state spaces, is lightweight and an important step toward fully autonomous end-to-end learning from pixels to torques

Community detection in complex networks via clique conductance

This is the final version. Available from the publisher via the DOI in this record.Network science plays a central role in understanding and modeling complex systems in many areas including physics, sociology, biology, computer science, economics, politics, and neuroscience. One of the most important features of networks is community structure, i.e., clustering of nodes that are locally densely interconnected. Communities reveal the hierarchical organization of nodes, and detecting communities is of great importance in the study of complex systems. Most existing community-detection methods consider low-order connection patterns at the level of individual links. But high-order connection patterns, at the level of small subnetworks, are generally not considered. In this paper, we develop a novel community-detection method based on cliques, i.e., local complete subnetworks. The proposed method overcomes the deficiencies of previous similar community-detection methods by considering the mathematical properties of cliques. We apply the proposed method to computer-generated graphs and real-world network datasets. When applied to networks with known community structure, the proposed method detects the structure with high fidelity and sensitivity. When applied to networks with no a priori information regarding community structure, the proposed method yields insightful results revealing the organization of these complex networks. We also show that the proposed method is guaranteed to detect near-optimal clusters in the bipartition case

Enhancement of laser-driven ion acceleration in non-periodic nanostructured targets

Using particle-in-cell simulations, we demonstrate an improvement of the target normal sheath acceleration (TNSA) of protons in non-periodically nanostructured targets with micron-scale thickness. Compared to standard flat foils, an increase in the proton cutoff energy by up to a factor of two is observed in foils coated with nanocones or perforated with nanoholes. The latter nano-perforated foils yield the highest enhancement, which we show to be robust over a broad range of foil thicknesses and hole diameters. The improvement of TNSA performance results from more efficient hot-electron generation, caused by a more complex laser-electron interaction geometry and increased effective interaction area and duration. We show that TNSA is optimized for a nanohole distribution of relatively low areal density and that is not required to be periodic, thus relaxing the manufacturing constraints.Comment: 11 pages, 8 figure

Seismic risk mapping for Germany

International audienceThe aim of this study is to assess and map the seismic risk for Germany, restricted to the expected losses of damage to residential buildings. There are several earthquake prone regions in the country which have produced Mw magnitudes above 6 and up to 6.7 corresponding to observed ground shaking intensity up to VIII?IX (EMS-98). Combined with the fact that some of the earthquake prone areas are densely populated and highly industrialized and where therefore the hazard coincides with high concentration of exposed assets, the damaging implications from earthquakes must be taken seriously. In this study a methodology is presented and pursued to calculate the seismic risk from (1) intensity based probabilistic seismic hazard, (2) vulnerability composition models, which are based on the distribution of residential buildings of various structural types in representative communities and (3) the distribution of assets in terms of replacement costs for residential buildings. The estimates of the risk are treated as primary economic losses due to structural damage to residential buildings. The obtained results are presented as maps of the damage and risk distributions. For a probability level of 90% non-exceedence in 50 years (corresponding to a mean return period of 475 years) the mean damage ratio is up to 20% and the risk up to hundreds of millions of euro in the most endangered communities. The developed models have been calibrated with observed data from several damaging earthquakes in Germany and the nearby area in the past 30 years

Lower Bounds for the Graph Homomorphism Problem

The graph homomorphism problem (HOM) asks whether the vertices of a given $n$-vertex graph $G$ can be mapped to the vertices of a given $h$-vertex graph $H$ such that each edge of $G$ is mapped to an edge of $H$. The problem generalizes the graph coloring problem and at the same time can be viewed as a special case of the $2$-CSP problem. In this paper, we prove several lower bound for HOM under the Exponential Time Hypothesis (ETH) assumption. The main result is a lower bound $2^{\Omega\left( \frac{n \log h}{\log \log h}\right)}$. This rules out the existence of a single-exponential algorithm and shows that the trivial upper bound $2^{{\mathcal O}(n\log{h})}$ is almost asymptotically tight. We also investigate what properties of graphs $G$ and $H$ make it difficult to solve HOM$(G,H)$. An easy observation is that an ${\mathcal O}(h^n)$ upper bound can be improved to ${\mathcal O}(h^{\operatorname{vc}(G)})$ where $\operatorname{vc}(G)$ is the minimum size of a vertex cover of $G$. The second lower bound $h^{\Omega(\operatorname{vc}(G))}$ shows that the upper bound is asymptotically tight. As to the properties of the "right-hand side" graph $H$, it is known that HOM$(G,H)$ can be solved in time $(f(\Delta(H)))^n$ and $(f(\operatorname{tw}(H)))^n$ where $\Delta(H)$ is the maximum degree of $H$ and $\operatorname{tw}(H)$ is the treewidth of $H$. This gives single-exponential algorithms for graphs of bounded maximum degree or bounded treewidth. Since the chromatic number $\chi(H)$ does not exceed $\operatorname{tw}(H)$ and $\Delta(H)+1$, it is natural to ask whether similar upper bounds with respect to $\chi(H)$ can be obtained. We provide a negative answer to this question by establishing a lower bound $(f(\chi(H)))^n$ for any function $f$. We also observe that similar lower bounds can be obtained for locally injective homomorphisms.Comment: 19 page

Time-resolved x-ray spectroscopy of optical-field-ionized plasmas

The time-dependent soft X-ray emission of helium and nitrogen plasmas generated by optical-field ionization is reported. The experiments were carried out by focusing pulses of the high-power Ti:sapphire laser of the Lund Institute of Technology (lambda = 796 nm, pulse duration 150 fs, pulse energy 150 mJ) to a 50-mu m diameter spot close to a nozzle, using He and N-2 as target gases. The emission on He+, N4+, and N3+ resonance lines was recorded by means of a flat-field grating spectrometer coupled to an X-ray streak camera. A pronounced difference in the temporal shape of the emission of the Lyman-alpha line of hydrogen-like helium and of the 2p-3d resonance lines of lithium-like and beryllium-like nitrogen was observed. The helium line exhibited an initial spike followed by a slow revival of the emission, whereas the nitrogen lines showed a slow decay after a fast initial rise. These observations are explained with the help of simulations

Time-resolved Studies of Light-propagation In Paper

A method for time-resolved recording of light scattering in thin, highly scattering media is described. Subpicosecond pulses from a high-power Ti:sapphire laser are used, and single-shot recordings of the scattered light are made with a fast streak camera. The method is applied to the study of light scattering in paper, and a 1-ps resolution is demonstrated. The dependence of the light scattering on the basis of weight and density of the paper has been studied. A white-light continuum generated from the high-power pulses by the use of self phase modulation in water is used to study the wavelength dependence of the scattering process. A model for the propagation of light in paper has been developed and used in Monte Carlo simulations. The experimental results are used for testing this model, and absorption and scattering parameters are determined from that comparison

Spectrum of mutations in the CFTR gene of patients with classical and atypical forms of cystic fibrosis from southwestern Sweden: Identification of 12 novel mutations

Cystic fibrosis (CF) is caused by mutations in the CFTR gene. The spectrum of CFTR mutations varies between populations and depends on different factors, such as ethnic background and geographical location. The extensive CFTR mutation screening of 129 patients with classical or atypical CF from the south-western region of Sweden revealed the presence of 37 CFTR mutations, including 12 novel alleles. The overall mutation detection rate in this study population was 92%, the highest among all tested regions in Sweden. Eight mutations with a frequency above 1% (ΔF508, 394delTT, R117C, 3659delC, E60X, 1112delT, R764X, and 621 + 1G → T) accounted for 78% of CF chromosomes and have been recommended for inclusion in the CFTR mutation screening panel for molecular diagnosis of CF in this region. The multiple occurrence of specific CFTR alleles less common than the predominant ΔF508 mutation (394delTT, R117C, 3659delC) allowed for genotype-phenotype comparisons and revealed consistent relationships between these mutations and disease severity.published_or_final_versio

Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs

The Multicut problem, given a graph G, a set of terminal pairs $\mathcal{T}=\{(s_i,t_i)\ |\ 1\leq i\leq r\}$, and an integer $p$, asks whether one can find a cutset consisting of at most $p$ nonterminal vertices that separates all the terminal pairs, i.e., after removing the cutset, $t_i$ is not reachable from $s_i$ for each $1\leq i\leq r$. The fixed-parameter tractability of Multicut in undirected graphs, parameterized by the size of the cutset only, has been recently proved by Marx and Razgon [SIAM J. Comput., 43 (2014), pp. 355--388] and, independently, by Bousquet, Daligault, and Thomassé [Proceedings of STOC, ACM, 2011, pp. 459--468], after resisting attacks as a long-standing open problem. In this paper we prove that Multicut is fixed-parameter tractable on directed acyclic graphs when parameterized both by the size of the cutset and the number of terminal pairs. We complement this result by showing that this is implausible for parameterization by the size of the cutset only, as this version of the problem remains $W[1]$-hard